NIFTy 3 – Numerical Information Field Theory: A Python Framework for Multicomponent Signal Inference on HPC Clusters

NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy  3, a major upgrade to the original NIFTy  framework. NIFTy  3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy  3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy  3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 .     

Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems

Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example.     

Linearly χ-bounding (P6, C4)-free graphs*

Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.     

Semi-concurrent vector fields in Finsler geometry

In the present paper, we give an answer to a question which is closely related to doubly warped product of Finsler metrics: ‘‘For each n, is there an n-dimensional Finsler manifold $(M,F)$, admitting a non-constant smooth function f on M such that $\frac{\partial f}{\partial x^i}\frac{\partial g^{ij}}{\partial y^k}=0$?”. We relate the preceding mentioned condition to different concepts appeared and studied in Finsler geometry. We introduce and investigate the notion of a semi concurrent vector field on a Finsler manifold. We show that some special Finsler manifolds admitting such vector fields turn out to be Riemannian. We prove that Tachibana's characterization of Finsler manifolds admitting a concurrent vector field leads to Riemannian metrics. Various examples for conic Finsler spaces that admit semi-concurrent vector field are presented.     

Sobolev H1 geometry of the symplectomorphism group

For a closed symplectic manifold $(M,\omega )$ with compatible Riemannian metric g we study the Sobolev $H^1$ geometry of the group of all $H^s$ diffeomorphisms on M which preserve the symplectic structure. We show that, for sufficiently large s, the $H^1$ metric admits globally defined geodesics and the corresponding exponential map is a non-linear Fredholm map of index zero. Finally, we show that the $H^1$ metric carries conjugate points via some simple examples.     

Law of the iterated logarithm for random graphs

A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles.     

Validating additive correction schemes against gradient-based extrapolations

The use of additive correction schemes to obtain structures and vibrational frequencies of increasingly larger molecules is becoming more common. Such approaches, based on the cubic extrapolation formula applied directly to the quantity of interest, have been successfully validated only at the highest levels of computational accuracy: for coupled cluster methods with comparably large basis sets. Here, a systematic validation of geometries and vibrational frequencies is carried out, including more affordable and relevant levels of theory, such as the Møller-Plesset perturbation theory applied with smaller basis sets. Comparisons of such additive schemes against the more rigorous gradient-based extrapolation are presented. The cbs () routine of the open-source quantum-chemistry package Psi4 has been extended for this purpose. The results confirm that geometries and frequencies of covalently bound species obtained with additive correction schemes are in an excellent agreement with the results of gradient-based extrapolations. However, when applied to systems involving noncovalent interactions, the errors due to such schemes are significantly larger. In general, we propose the application of gradient-based extrapolations, as they incur no extra cost compared to additive schemes.     

Exceptional points of the Lindblad operator of a two-level system

The Lindblad equation for a two-level system under an electric field is analyzed by mapping to a linear equation with a non-Hermitian matrix. Exceptional points of the matrix are found to be extensive; the second-order ones are located on lines in a two-dimensional parameter space, while the third-order one is at a point.